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 21, 2025 20:54Adam FolwarcznyAdam FolwarcznyScore: 17,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2025 20:5417,338163,933,372141,911,0001,998,0002,433,024
2Aug 21, 2025 20:5417,340165,963,145141,920,0001,998,0002,437,120
3Aug 21, 2025 20:5417,340166,782,061141,927,0001,998,0002,531,328
4Aug 21, 2025 20:5417,341169,187,375141,933,0001,999,0002,531,328
5Aug 21, 2025 20:5417,343164,938,700141,951,0001,999,0002,531,328
6Aug 21, 2025 20:5417,344168,337,206141,958,0001,999,0002,531,328
7Aug 21, 2025 20:5417,344167,251,415141,956,0001,999,0002,445,312
8Aug 21, 2025 20:5417,345163,664,837141,968,0001,999,0002,531,328
9Aug 21, 2025 20:5417,356163,446,285142,054,0002,000,0002,531,328