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 18, 2026 10:22shartgepettoshartgepettoScore: 6,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 10:226,29781,972,73050,253,0002,010,0002,392,064
2Mar 18, 2026 10:226,29873,504,96451,270,0001,005,0002,392,064
3Mar 18, 2026 10:226,30476,072,64848,299,0004,024,0002,473,984
4Mar 18, 2026 10:226,33977,398,93450,588,0002,023,0002,465,792
5Mar 18, 2026 10:226,40176,114,80750,122,0003,007,0002,367,488
6Mar 18, 2026 10:226,40178,241,96250,118,0003,007,0002,498,560
7Mar 18, 2026 10:226,40776,570,07150,167,0003,010,0002,367,488
8Mar 18, 2026 10:226,57673,827,55951,546,0003,032,0002,383,872
9Mar 18, 2026 10:226,67979,086,19352,413,0003,023,0002,363,392