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 listMay 10, 2026 02:57Josu San MartinJosu San MartinScore: 4,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 02:574,58755,185,19236,890,0001,185,0002,473,984
2May 10, 2026 02:574,64152,688,88037,353,0001,169,0002,469,888
3May 10, 2026 02:574,68953,103,41937,656,0001,264,0002,486,272
4May 10, 2026 02:574,75152,050,19238,205,0001,229,0002,473,984
5May 10, 2026 02:574,75355,600,44638,229,0001,221,0002,473,984
6May 10, 2026 02:574,75753,739,20238,189,0001,302,0002,326,528
7May 10, 2026 02:574,89457,754,05939,402,0001,225,0002,473,984
8May 10, 2026 02:574,99759,190,84040,276,0001,204,0002,465,792
9May 10, 2026 02:575,12257,188,71541,312,0001,202,0002,453,504