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 listNov 1, 2025 22:59Jake LJake LScore: 2,068,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2025 22:592,064,19117,170,557,44017,064,822,00067,963,0002,277,376
2Nov 1, 2025 22:592,067,81617,196,983,10017,089,910,00072,965,0002,277,376
3Nov 1, 2025 22:592,068,19717,203,885,97317,099,076,00066,961,0002,277,376
4Nov 1, 2025 22:592,068,36717,202,919,11517,101,476,00065,967,0002,289,664
5Nov 1, 2025 22:592,068,41817,202,486,54717,097,910,00069,962,0002,277,376
6Nov 1, 2025 22:592,068,65917,201,417,30417,099,902,00069,966,0002,277,376
7Nov 1, 2025 22:592,068,95017,207,947,29017,113,311,00058,973,0002,277,376
8Nov 1, 2025 22:592,071,37617,224,512,98817,131,446,00060,973,0002,269,184
9Nov 1, 2025 22:592,078,31217,282,982,14917,175,026,00074,965,0002,277,376