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 19, 2025 02:44Ashish AhujaAshish AhujaScore: 10,456Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2025 02:4410,327111,159,30778,741,0006,977,0002,326,528
2Aug 19, 2025 02:4410,338109,046,77580,821,0004,988,0002,285,568
3Aug 19, 2025 02:4410,393104,903,99678,242,0008,024,0002,527,232
4Aug 19, 2025 02:4410,424117,400,97579,557,0006,961,0002,285,568
5Aug 19, 2025 02:4410,427113,646,25680,573,0005,968,0002,285,568
6Aug 19, 2025 02:4410,431114,677,95982,595,0003,980,0002,420,736
7Aug 19, 2025 02:4410,456111,971,15079,805,0006,982,0002,371,584
8Aug 19, 2025 02:4410,518110,406,19380,273,0007,023,0002,506,752
9Aug 19, 2025 02:4410,536113,822,68980,491,0006,956,0002,437,120
10Aug 19, 2025 02:4410,546114,093,67779,575,0007,957,0002,285,568
11Aug 19, 2025 02:4410,547114,872,86380,574,0006,963,0002,334,720
12Aug 19, 2025 02:4410,811112,473,54382,752,0006,979,0002,289,664