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 listApr 27, 2026 05:37wnwnScore: 3,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 05:373,40746,953,67927,272,0001,010,0002,330,624
2Apr 27, 2026 05:373,45847,406,75327,681,0001,025,0002,486,272
3Apr 27, 2026 05:373,51846,814,64628,196,0001,007,0002,494,464
4Apr 27, 2026 05:373,59346,204,36727,835,0001,988,0002,494,464
5Apr 27, 2026 05:373,62347,548,95328,070,0002,005,0002,473,984
6Apr 27, 2026 05:373,63241,773,65028,142,0002,010,0002,330,624
7Apr 27, 2026 05:373,82650,418,89531,756,00002,293,760
8Apr 27, 2026 05:373,87151,762,76230,125,0002,008,0002,482,176
9Apr 27, 2026 05:374,25349,921,54734,300,0001,008,0002,314,240