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 listMar 6, 2026 17:57Josu San MartinJosu San MartinScore: 5,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 17:575,63572,748,89443,785,0002,985,0002,277,376
2Mar 6, 2026 17:575,85074,524,38848,556,00002,396,160
3Mar 6, 2026 17:575,85076,653,05247,546,0001,011,0002,277,376
4Mar 6, 2026 17:575,86380,843,82248,663,00002,400,256
5Mar 6, 2026 17:575,90973,362,80946,044,0003,002,0002,273,280
6Mar 6, 2026 17:575,95275,010,32648,394,0001,008,0002,400,256