Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listOct 15, 2024 17:14Elnur RakhmatullinElnur RakhmatullinScore: 60,217Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 17:1360,094527,825,139441,805,00056,974,0002,289,664
2Oct 15, 2024 17:1360,123524,430,499445,017,00054,002,0002,281,472
3Oct 15, 2024 17:1360,161524,466,800445,303,00054,036,0002,506,752
4Oct 15, 2024 17:1160,195526,622,511441,662,00057,955,0002,482,176
5Oct 15, 2024 17:1160,217522,335,546446,823,00052,979,0002,486,272
6Oct 15, 2024 17:1160,255529,894,276453,108,00047,011,0002,289,664
7Oct 15, 2024 17:1460,810528,083,522445,755,00058,967,0002,281,472
8Oct 15, 2024 17:1460,831531,282,871448,907,00055,988,0002,514,944
9Oct 15, 2024 17:1460,893537,758,966450,366,00055,044,0002,510,848