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 02:34wnwnScore: 3,510Success
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 02:343,40144,409,51327,224,0001,008,0002,494,464
2Apr 27, 2026 02:343,44547,523,32627,574,0001,021,0002,478,080
3Apr 27, 2026 02:343,46042,450,00627,698,0001,025,0002,482,176
4Apr 27, 2026 02:343,46445,572,93526,771,0001,983,0002,490,368
5Apr 27, 2026 02:343,51046,535,31027,129,0002,009,0002,490,368
6Apr 27, 2026 02:343,52942,933,75428,288,0001,010,0002,482,176
7Apr 27, 2026 02:343,55852,648,19528,521,0001,018,0002,482,176
8Apr 27, 2026 02:343,63252,124,46128,137,0002,009,0002,478,080
9Apr 27, 2026 02:343,68245,740,73629,543,0001,018,0002,486,272