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 24, 2026 05:05EdgarEdgarScore: 140,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 05:06139,0501,174,120,3381,152,019,0002,099,0002,117,632
2Sep 24, 2026 05:06139,4421,167,775,8571,156,374,0001,001,0002,117,632
3Sep 24, 2026 05:06139,4751,168,118,7661,156,648,0001,001,0002,117,632
4Sep 24, 2026 05:06139,7431,170,207,4341,158,870,0001,001,0002,117,632
5Sep 24, 2026 05:06140,9081,179,848,0071,168,538,0001,001,0002,117,632
6Sep 24, 2026 05:06141,1801,182,727,8811,170,796,0001,003,0002,117,632
7Sep 24, 2026 05:06141,2191,182,464,8471,171,116,0001,002,0002,117,632
8Sep 24, 2026 05:06141,3211,183,380,7651,170,961,0002,005,0002,117,632
9Sep 24, 2026 05:06143,5651,201,976,9801,190,591,0001,002,0002,117,632