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 07:46Josu San MartinJosu San MartinError
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 07:46064,961,87349,056,0001,017,0002,486,272expected "53688488679851462 ", got "53688492180263230 "
2May 10, 2026 07:46065,833,86448,623,0001,072,0002,482,176expected "53687951489738454 ", got "53687951760055573 "
3May 10, 2026 07:465,93364,961,79148,215,0001,033,0002,490,368
4May 10, 2026 07:465,94865,173,17348,332,0001,044,0002,482,176
5May 10, 2026 07:465,95764,916,81948,335,0001,114,0002,482,176
6May 10, 2026 07:465,96767,182,52748,479,0001,051,0002,482,176
7May 10, 2026 07:465,97666,855,71448,559,0001,050,0002,482,176
8May 10, 2026 07:465,98564,447,43648,634,0001,043,0002,498,560
9May 10, 2026 07:466,00264,515,89848,777,0001,040,0002,473,984