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 listAug 2, 2026 17:44George SeabridgeGeorge SeabridgeScore: 7,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:446,67765,343,28753,179,0002,248,0002,113,536
2Aug 2, 2026 17:446,71365,632,64953,454,0002,269,0002,113,536
3Aug 2, 2026 17:446,76466,798,08653,844,0002,304,0002,113,536
4Aug 2, 2026 17:447,24770,109,76157,958,0002,200,0002,113,536
5Aug 2, 2026 17:447,31670,606,10158,492,0002,237,0002,113,536
6Aug 2, 2026 17:447,32570,718,39158,552,0002,246,0002,113,536
7Aug 2, 2026 17:447,35571,688,55458,784,0002,270,0002,113,536
8Aug 2, 2026 17:447,36471,163,62458,849,0002,274,0002,113,536
9Aug 2, 2026 17:447,42372,235,19759,379,0002,232,0002,113,536