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 13, 2026 10:01Dominique GarmierDominique GarmierScore: 36,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 10:0136,046324,274,212298,183,0001,000,0002,273,280
2Mar 13, 2026 10:0136,051322,217,046298,221,0001,000,0002,383,872
3Mar 13, 2026 10:0136,068329,272,175298,361,0001,001,0002,400,256
4Mar 13, 2026 10:0136,075326,195,054298,424,0001,001,0002,273,280
5Mar 13, 2026 10:0136,087328,833,987297,530,0001,996,0002,273,280
6Mar 13, 2026 10:0136,227326,162,658298,686,0001,997,0002,392,064
7Mar 13, 2026 10:0136,229324,018,847298,701,0001,998,0002,273,280
8Mar 13, 2026 10:0136,239329,255,394298,786,0001,998,0002,392,064
9Mar 13, 2026 10:0136,248323,943,455298,862,0001,999,0002,273,280