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 21, 2026 18:21Mohamed Elmahdi BendimeradMohamed Elmahdi BendimeradScore: 78,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 18:2178,858676,063,713591,569,00062,954,0002,367,488
2Apr 21, 2026 18:2178,864674,155,874592,521,00062,054,0002,359,296
3Apr 21, 2026 18:2178,976671,373,618594,551,00060,953,0002,351,104
4Apr 21, 2026 18:2178,979672,613,464591,574,00063,953,0002,322,432
5Apr 21, 2026 18:2178,989673,355,366592,647,00062,962,0002,367,488
6Apr 21, 2026 18:2178,994673,509,068594,689,00060,968,0002,314,240
7Apr 21, 2026 18:2179,029672,047,230592,947,00062,994,0002,355,200
8Apr 21, 2026 18:2179,069675,010,159594,347,00061,932,0002,363,392
9Apr 21, 2026 18:2179,149677,921,330591,949,00064,994,0002,351,104