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 3, 2026 20:09TudyMTudyMScore: 53,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:1053,082458,201,845439,574,0001,009,0002,363,392
2May 3, 2026 20:1053,139457,435,895440,057,0001,003,0002,379,776
3May 3, 2026 20:1053,139455,231,805440,059,0001,002,0002,371,584
4May 3, 2026 20:1053,147457,667,843440,124,0001,002,0002,359,296
5May 3, 2026 20:1053,168459,816,858440,295,0001,005,0002,371,584
6May 3, 2026 20:1053,171456,170,073440,321,0001,005,0002,371,584
7May 3, 2026 20:1053,175459,625,176440,350,0001,004,0002,371,584
8May 3, 2026 20:1053,196459,716,542440,531,0001,004,0002,387,968
9May 3, 2026 20:1053,199459,817,793440,551,0001,003,0002,379,776