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 12:13shartgepettoshartgepettoScore: 6,085Success
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 12:136,06774,320,93647,332,0003,021,0002,437,120
2Mar 18, 2026 12:136,07072,999,72749,371,0001,007,0002,359,296
3Mar 18, 2026 12:136,07677,371,30448,413,0002,017,0002,473,984
4Mar 18, 2026 12:136,08273,750,86449,469,0001,009,0002,502,656
5Mar 18, 2026 12:136,08573,717,78748,488,0002,020,0002,392,064
6Mar 18, 2026 12:136,10978,846,18146,731,0003,977,0002,297,856
7Mar 18, 2026 12:136,15673,625,41848,092,0003,005,0002,486,272
8Mar 18, 2026 12:136,19974,303,80249,434,0002,017,0002,486,272
9Mar 18, 2026 12:136,31374,313,85949,376,0003,023,0002,453,504