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 13, 2026 08:03wnwnScore: 4,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 08:034,16864,113,55633,580,0001,017,0002,277,376
2Apr 13, 2026 08:034,19559,436,71732,830,0001,989,0002,277,376
3Apr 13, 2026 08:034,19564,210,38732,833,0001,989,0002,490,368
4Apr 13, 2026 08:034,22760,477,05833,081,0002,004,0002,277,376
5Apr 13, 2026 08:034,23358,167,54533,131,0002,007,0002,277,376
6Apr 13, 2026 08:034,33455,992,71033,977,0001,998,0002,498,560
7Apr 13, 2026 08:034,33559,781,32333,980,0001,998,0002,277,376
8Apr 13, 2026 08:034,33659,860,90933,986,0001,999,0002,498,560
9Apr 13, 2026 08:034,34656,981,72034,066,0002,003,0002,494,464