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 listSep 29, 2023 13:22LukasLukasScore: 42,883Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2023 14:0942,838437,801,300355,552,62202,289,664
2Sep 29, 2023 13:1942,852417,142,002355,674,89902,277,376
3Oct 20, 2023 14:0942,864424,794,398355,769,88802,281,472
4Sep 29, 2023 13:1942,880421,432,491355,903,45002,293,760
5Sep 29, 2023 13:2242,883432,649,901355,929,34302,289,664
6Sep 29, 2023 13:2243,569428,886,716361,619,80102,281,472
7Oct 20, 2023 14:0943,569429,395,358361,625,61602,285,568
8Sep 29, 2023 13:1943,577425,114,044361,687,39302,256,896
9Sep 29, 2023 13:2243,600423,682,631361,878,22802,273,280