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 20:36Josu 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 20:374,26943,903,96734,399,0001,038,0002,113,536
2Aug 30, 2026 20:374,27043,869,61234,402,0001,041,0002,113,536
3Aug 30, 2026 20:374,28244,008,29134,511,0001,034,0002,113,536
4Aug 30, 2026 20:374,28944,110,97634,554,0001,047,0002,113,536
5Aug 30, 2026 20:374,29744,123,03334,554,0001,112,0002,113,536
6Aug 30, 2026 20:374,30144,136,53934,575,0001,128,0002,113,536
7Aug 30, 2026 20:374,30544,130,72434,634,0001,100,0002,113,536
8Aug 30, 2026 20:374,30844,216,12434,715,0001,044,0002,113,536
9Aug 30, 2026 20:374,34644,523,49934,962,0001,114,0002,113,536