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 listJul 27, 2024 22:26Lickety SplitLickety SplitScore: 550,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2024 22:26549,33315,770,983,0714,559,467,97402,211,840
2Jul 27, 2024 22:26550,79816,208,167,2264,571,621,84302,195,456
3Jul 27, 2024 22:26556,29916,438,894,5324,617,277,78902,240,512