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 listAug 30, 2026 21:45Josu San MartinJosu San MartinScore: 4,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 21:464,28244,020,18834,502,0001,046,0002,113,536
2Aug 30, 2026 21:464,28243,987,13734,517,0001,025,0002,113,536
3Aug 30, 2026 21:464,28344,065,53534,517,0001,032,0002,113,536
4Aug 30, 2026 21:464,29444,078,57234,601,0001,042,0002,113,536
5Aug 30, 2026 21:464,29744,186,72234,656,0001,010,0002,113,536
6Aug 30, 2026 21:464,31644,392,28134,700,0001,124,0002,113,536
7Aug 30, 2026 21:464,31844,320,94234,806,0001,037,0002,113,536
8Aug 30, 2026 21:464,33044,441,43934,837,0001,107,0002,113,536
9Aug 30, 2026 21:464,33044,414,18334,847,0001,100,0002,113,536