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 22, 2026 00:11Taylor DettlingTaylor DettlingScore: 51,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 00:1151,476448,318,834425,257,0002,001,0002,342,912
2Apr 22, 2026 00:1151,485448,685,278426,331,0001,000,0002,359,296
3Apr 22, 2026 00:1151,493441,121,254426,396,0001,000,0002,351,104
4Apr 22, 2026 00:1151,497442,092,093425,426,0002,002,0002,334,720
5Apr 22, 2026 00:1151,499450,465,694425,447,0002,002,0002,334,720
6Apr 22, 2026 00:1151,510445,505,025425,542,0001,997,0002,334,720
7Apr 22, 2026 00:1151,513445,641,283424,564,0002,996,0002,359,296
8Apr 22, 2026 00:1151,519441,672,654423,615,0003,996,0002,351,104
9Apr 22, 2026 00:1151,554441,871,676425,907,0001,999,0002,322,432