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 listSep 23, 2026 08:10Kevin HeaveyKevin HeaveyScore: 3,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 08:123,32736,415,52426,515,0001,107,0002,113,536
2Sep 23, 2026 08:123,32936,453,38026,540,0001,091,0002,113,536
3Sep 23, 2026 08:123,33136,511,79526,528,0001,125,0002,113,536
4Sep 23, 2026 08:123,33436,292,26526,547,0001,133,0002,113,536
5Sep 23, 2026 08:123,33536,552,58926,503,0001,180,0002,113,536
6Sep 23, 2026 08:123,33636,561,78326,570,0001,123,0002,113,536
7Sep 23, 2026 08:123,34736,480,71426,599,0001,186,0002,113,536
8Sep 23, 2026 08:123,35337,150,12626,812,0001,022,0002,113,536
9Sep 23, 2026 08:123,35536,570,47226,729,0001,123,0002,113,536