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 05:56wnwnScore: 3,452Success
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 05:563,40245,665,66427,232,0001,008,0002,490,368
2Apr 27, 2026 05:563,41444,762,54227,331,0001,012,0002,486,272
3Apr 27, 2026 05:563,44747,194,71027,594,0001,022,0002,482,176
4Apr 27, 2026 05:563,44846,136,26127,597,0001,022,0002,498,560
5Apr 27, 2026 05:563,45242,893,85027,631,0001,023,0002,482,176
6Apr 27, 2026 05:563,52846,255,88628,276,0001,009,0002,486,272
7Apr 27, 2026 05:563,55646,024,99728,502,0001,017,0002,482,176
8Apr 27, 2026 05:563,59444,342,66727,843,0001,988,0002,486,272
9Apr 27, 2026 05:563,65650,978,85629,340,0001,011,0002,482,176