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 7, 2026 15:06Kevin PetersKevin PetersScore: 70,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:0770,716596,990,667529,959,00056,987,0002,113,536
2Sep 7, 2026 15:0770,775597,374,140530,301,00057,138,0002,113,536
3Sep 7, 2026 15:0770,801597,562,133530,139,00057,516,0002,113,536
4Sep 7, 2026 15:0770,841597,947,946530,056,00057,929,0002,113,536
5Sep 7, 2026 15:0770,860598,128,440529,964,00058,177,0002,113,536
6Sep 7, 2026 15:0770,866598,143,770530,240,00057,950,0002,113,536
7Sep 7, 2026 15:0770,910598,444,650530,319,00058,240,0002,113,536
8Sep 7, 2026 15:0770,917599,827,224529,543,00059,073,0002,113,536
9Sep 7, 2026 15:0770,930598,698,550529,890,00058,834,0002,113,536