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 29, 2026 18:04Charles CabergsCharles CabergsScore: 12,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 18:0412,801125,832,858105,250,0001,002,0002,355,200
2Apr 29, 2026 18:0412,801125,947,399105,249,0001,002,0002,367,488
3Apr 29, 2026 18:0412,806123,850,310104,289,0002,005,0002,367,488
4Apr 29, 2026 18:0412,814123,027,906105,354,0001,003,0002,371,584
5Apr 29, 2026 18:0412,886119,548,702104,959,0001,999,0002,367,488
6Apr 29, 2026 18:0412,888123,925,151104,979,0001,999,0002,371,584
7Apr 29, 2026 18:0412,902126,471,796105,089,0002,001,0002,375,680
8Apr 29, 2026 18:0412,912124,823,584105,172,0002,003,0002,363,392
9Apr 29, 2026 18:0413,000125,547,175105,904,0001,998,0002,310,144